Characterizing Markov equivalence classes for AMP chain graph models
نویسندگان
چکیده
منابع مشابه
Characterizing Markov Equivalence Classes for Amp Chain Graph Models
Indiana University and the University of Washington 2Chain graphs (CG) (= adicyclic graphs) use undirected and directed edges to represent simultaneously both structural and associative dependences.. Like acyclic directed graphs (ADGs), the CG associated with a given statistical model may not be unique, so CGs fall into Markov equivalence classes, which may be superexponentially large, leading ...
متن کاملSeparation and Completeness Properties for Amp Chain Graph Markov Models
Pearl’s well-known d-separation criterion for an acylic directed graph (ADG) is a pathwise separation criterion that can be used to efficiently identify all valid conditional independence relations in the Markov model determined by the graph. This paper introduces p-separation, a pathwise separation criterion that efficiently identifies all valid conditional independences under the Andersson-Ma...
متن کاملA Graphical Representation of Equivalence Classes of AMP Chain Graphs
This paper deals with chain graph models under alternative AMP interpretation. A new representative of an AMP Markov equivalence class, called the largest deflagged graph, is proposed. The representative is based on revealed internal structure of the AMP Markov equivalence class. More specifically, the AMP Markov equivalence class decomposes into finer strong equivalence classes and there exist...
متن کاملThe graph of equivalence classes and Isoclinism of groups
Let $G$ be a non-abelian group and let $Gamma(G)$ be the non-commuting graph of $G$. In this paper we define an equivalence relation $sim$ on the set of $V(Gamma(G))=Gsetminus Z(G)$ by taking $xsim y$ if and only if $N(x)=N(y)$, where $ N(x)={uin G | x textrm{ and } u textrm{ are adjacent in }Gamma(G)}$ is the open neighborhood of $x$ in $Gamma(G)$. We introduce a new graph determined ...
متن کاملMarkov Equivalence Classes for Maximal Ancestral Graphs
Ancestral graphs provide a class of graphs that can encode conditional independence re lations that arise in directed acyclic graph (DAG) models with latent and selection vari ables, corresponding to marginalization and conditioning. However, for any ancestral graph, there may be several other graphs to which it is Markov equivalent. We introduce a simple representation of a Markov equiv ale...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 2006
ISSN: 0090-5364
DOI: 10.1214/009053606000000173